Fractal based Image Compression techniques - A progress Report

نویسنده

  • U. Nandi
چکیده

One well-known loss-less image technique is DCT-based JPEG compression that is quite effective at low or moderate compression ratios, up to ratios of 20 or 25 to 1. Beyond this point, the image becomes very “blocky” as the compression increases and the image quality becomes too poor for practical use. Another drawback of JPEG compression is its resolution dependence. In order to “zoom-in” on a portion of an image and to enlarge it, it is necessary to replicate pixels. The enlarged image will exhibit a certain level of “blockiness” which soon becomes unacceptable as the expansion factor increases. Because of this problem, it is sometimes necessary to store the same image at different resolutions, thus wasting storage space. So, although JPEG is now a well-established standard for lossy image compression, it has its limits and alternative compression methods must be considered. Wavelet-based methods are gaining popularity. They are similar in spirit to the DCT methods but do not suffer from some of its shortcomings. Another technique that is become very popular is fractal image compression. It really shines for high compression ratios, or when zooming on a portion of an image or enlarging a complete image. Some fractal based lossy image compression techniques i.e. FICAQP, FCI-HV and FLCD-HV are proposed by the candidate. FICAQP offers better compression rates most of the times with comparatively improved PSNR. But, the compression time of the fractal image compression with proposed partitioning scheme is much more than quadtree scheme. FCI-HV and FLCD-HV are better than quadtree partitioning in terms of compression ratio and faster than HV partitioning scheme. Keyword Fractal compression, compression ratio, Quardtree partition, Affine map, Iterated Function Systems (IFS),Partitioned Iterated Function Systems (PIFS), Region Based Huffman (RBH), Compression, Modified Region Based Huffman (MRBH), Region Selection Algorithm (RSA), Huffman Tree, Frequency Table (FT), Symbol Code Table (SCT), LZW, dictionary-based compression, OLZW;

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MEDICAL IMAGE COMPRESSION: A REVIEW

Within recent years the use of medical images for diagnosis purposes has become necessity. The limitation in transmission and storage space also growing size of medical images has necessitated the need for efficient method, then image Compression is required as an efficient way to reduces irrelevant and redundancy of the image data in order to be able to store or transmits data. It also reduces...

متن کامل

Implementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey

Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...

متن کامل

Performance of Kick-Out Condition Based Speedup Techniques in Fractal Image Compression

Fractal Image compression is a ground-breaking image compression technique in the area of image processing. This technique is based on fractals rather than pixels. It is advantageous in compression ratio, decompression speed, bitrate and resolution independence. But in conjunction with above advantages, the encoding phase of this technique consumes huge time, which is a major drawback and restr...

متن کامل

On Approximating Rough Curves With Fractal Functions

Fractal functions are explored as a representation for rough data in computer graphics. Two new techniques for using fractal interpolation functions to approximate rough functions and curves are introduced. The first is based on a Hough transform of fractal function transformation parameters. The second is based on previous techniques in fractal image compression. These techniques are then demo...

متن کامل

Issues in Implementing Block-Based Image Compression Techniques on Parallel MIMD Architectures

Although block-based image compression techniques seem to be straightforward to implement on parallel MIMD architectures, problems might arise due to architectural restrictions on such parallel machines (e.g. memory constraints on distributed memory architectures). In this paper we discuss possible solutions to such problems occurring in diierent image compression techniques. Experimental resul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013